On Divisibility of Narayana Numbers by Primes
نویسندگان
چکیده
Using Kummer’s theorem, we give a necessary and sufficient condition for a Narayana number to be divisible by a given prime. We use this to derive certain properties of the Narayana triangle. 1 The main theorem Let N denote the nonnegative integers and let k, n ∈ N. The Narayana numbers [10, A001263] can be defined as N(n, k) = 1 n (
منابع مشابه
Catalan Numbers, Primes and Twin Primes
with C0 = 1. Their appearances occur in a dazzling variety of combinatorial settings where they are used to enumerate all manner of geometric and algebraic objects (see Richard Stanley’s collection [28, Chap. 6]; an online Addendum is continuously updated). Quite a lot is known about the divisibility of the Catalan numbers; see [2, 10]. They are obviously closely related to the middle binomial ...
متن کاملA Survey of Results on Primes in Short Intervals
Prime numbers have been a source of fascination for mathematicians since antiquity. The proof that there are infinitely many prime numbers is attributed to Euclid (fourth century B.C.). The basic method of determining all primes less than a given number N is the sieve of Eratosthenes (third century B.C.). Diophantus (third (?) century A.D.) was occupied with finding rational number solutions to...
متن کاملRiemann’s zeta function and the prime series display a biotic pattern of diversification, novelty, and complexity
Here we investigate the processes of accumulation and rotation in the generation of novelty by examining series generated by the accumulation of primes and approximations to the primes via progressive divisibility selections, and series generated by Riemann’s equation. Riemann’s zeta function is a re-encoding of the structure of the prime numbers. These studies indicate that the generation of p...
متن کاملTrigonometric Expressions for Fibonacci and Lucas Numbers
The amount of literature bears witness to the ubiquity of the Fibonacci numbers and the Lucas numbers. Not only these numbers are popular in expository literature because of their beautiful properties, but also the fact that they ‘occur in nature’ adds to their fascination. Our purpose is to use a certain polynomial identity to express these numbers in terms of trigonometric functions. It is in...
متن کاملSieve Methods Lecture Notes, Part I the Brun-hooley Sieve
A sieve is a technique for bounding the size of a set after the elements with “undesirable properties” (usually of a number theoretic nature) have been removed. The undesirable properties could be divisibility by a prime from a given set, other multiplicative constraints (divisibility by a perfect square for example) or inclusion in a set of residue classes. The methods usually involve some kin...
متن کامل